package com.wc.AlgoOJ._数学.阶乘约数;

import java.io.BufferedReader;
import java.io.IOException;
import java.io.InputStreamReader;
import java.io.PrintWriter;
import java.util.StringTokenizer;

/**
 * @Author congge
 * @Date 2024/10/1 14:06
 * @description http://43.138.190.70:8888/p/LQ1138T
 */
public class Main {
    /**
     * 思路：
     * 公式 + 试除法
     */
    static FastReader sc = new FastReader();
    static PrintWriter out = new PrintWriter(System.out);
    static int N = 110, M = (int) 1e7;
    static long[] w = new long[N];
    static int[] num = new int[N];
    static boolean[] st = new boolean[M];
    static int[] prime = new int[M / 10];
    static int idx = 0;
    static int n;

    static void ola() {
        st[0] = st[1] = true;
        for (int i = 2; i < M; i++) {
            if (!st[i]) prime[++idx] = i;
            for (int j = 1; i * prime[j] < M; j++) {
                st[i * prime[j]] = true;
                if (i % prime[j] == 0) break;
            }
        }
    }

    public static void main(String[] args) {
        int T = sc.nextInt();
        for (int x = 1; x <= 100; x++) {
            int a = x;
            for (int i = 2; i * i <= a; i++) {
                if (a % i == 0) {
                    int s = 0;
                    while (a % i == 0) {
                        a /= i;
                        s++;
                    }
                    num[i] += s;
                }
            }
            if (a > 1) num[a]++;
            w[x] = 1;
            for (int i = 1; i <= 100; i++) {
                w[x] *= (1 + num[i]);
            }
        }
        while (T-- > 0) {
            n = sc.nextInt();
            out.println(w[n]);
        }
        out.flush();
    }
}

class FastReader {
    StringTokenizer st;
    BufferedReader br;

    FastReader() {
        br = new BufferedReader(new InputStreamReader(System.in));
    }

    String next() {
        while (st == null || !st.hasMoreElements()) {
            try {
                st = new StringTokenizer(br.readLine());
            } catch (IOException e) {
                e.printStackTrace();
            }
        }
        return st.nextToken();
    }

    int nextInt() {
        return Integer.parseInt(next());
    }

    String nextLine() {
        String s = "";
        try {
            s = br.readLine();
        } catch (IOException e) {
            e.printStackTrace();
        }
        return s;
    }

    long nextLong() {
        return Long.parseLong(next());
    }

    double nextDouble() {
        return Double.parseDouble(next());
    }

    // 是否由下一个
    boolean hasNext() {
        while (st == null || !st.hasMoreTokens()) {
            try {
                String line = br.readLine();
                if (line == null)
                    return false;
                st = new StringTokenizer(line);
            } catch (IOException e) {
                throw new RuntimeException(e);
            }
        }
        return true;
    }
}
